Ranking Highlight Level of Movie Clips: A Template Based Adaptive Kernel SVM Method

نویسندگان

  • Zheng Wang
  • Gaojun Ren
  • Meijun Sun
  • Jinchang Ren
  • Jesse S. Jin
چکیده

This paper looks into a new direction in movie clips analysis –model based ranking of highlight level. A movie clip, containing a short story, is composed of several continuous shots, which is much simpler than the whole movie. As a result, clip based analysis provides a feasible way for movie analysis and interpretation. In this paper, clip-based ranking of highlight level is proposed, where the challenging problem in detecting and recognizing events within clips is not required. Due to the lack of publicly available datasets, we firstly construct a database of movie clips, where each clip is associated with manually derived highlight level as ground truth. From each clip a number of effective visual cues are then extracted. To bridge the gap between low-level features and highlight level semantics, a holistic method of highlight ranking model is introduced. According to the distance between testing clips and selected templates, appropriate kernel function of Support Vector Machine (SVM) is adaptively selected. Promising results are reported in automatic ranking of movie highlight levels. Keywords-video analysis; highlight level; movie clip; template based method; adaptive kernal SVM

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Impact of Humorous Movie Clips on Better Learning of English Language Vocabulary

This study examined the effects of humorous movie clips on better learning of English language vocabulary. Humor is an important human behavior that plays a vital role in communication and social interactions. This subject has been rarely investigated in Iranian English classes. The researchers used quantitative method. Because all of variables were not controllable, therefore quasi-experimenta...

متن کامل

A New Learning Algorithm for the Fusion of Adaptive Audio-Visual Features for the Retrieval and Classification of Movie Clips

This paper presents a new learning algorithm for audiovisual fusion and demonstrates its application to video classification for film database. The proposed system utilized perceptual features for content characterization of movie clips. These features are extracted from different modalities and fused through a machine learning process. More specifically, in order to capture the spatio-temporal...

متن کامل

MODELING OF FLOW NUMBER OF ASPHALT MIXTURES USING A MULTI–KERNEL BASED SUPPORT VECTOR MACHINE APPROACH

Flow number of asphalt–aggregate mixtures as an explanatory factor has been proposed in order to assess the rutting potential of asphalt mixtures. This study proposes a multiple–kernel based support vector machine (MK–SVM) approach for modeling of flow number of asphalt mixtures. The MK–SVM approach consists of weighted least squares–support vector machine (WLS–SVM) integrating two kernel funct...

متن کامل

Audio-Video based Classification using SVM and AANN

This paper presents a method to classify audio-video data into one of five classes: advertisement, cartoon, news, movie and songs. Automatic audio-video classification is very useful to audio-video indexing, content based audio-video retrieval. Mel frequency cepstral coefficients are used to characterize the audio data. The color histogram features extracted from the images in the video clips a...

متن کامل

Regularization path for Ranking SVM

Ranking algorithms are often introduced with the aim of automatically personalising search results. However, most ranking algorithms developed in the machine learning community rely on a careful choice of some regularisation parameter. Building upon work on the regularisation path for kernel methods, we propose a parameter selection algorithm for ranking SVM. Empirical results are promising.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Vis. Lang. Comput.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2014